Subalgebra Lattices of a Partial Unary Algebra
نویسنده
چکیده
Necessary and sufficient conditions will be found for quadruples of lattices to be isomorphic to lattices of weak, relative, strong subalgebras and initial segments, respectively, of one partial unary algebra. To this purpose we will start with a characterization of pairs of lattices that are weak and strong subalgebra lattices of one partial unary algebra, respectively. Next, we will describe the initial segment lattice of a partial unary algebra. Applying this result, pairs of lattices of strong subalgebras and initial segments will be characterized. Further, we will characterize pairs of lattices of relative and strong subalgebras and also other pairs of subalgebra lattices of one partial unary algebra.
منابع مشابه
On Subalgebra Lattices of a Finite Unary Algebra Ii
We use graph-algebraic results proved in [8] and some results of the graph theory to characterize all pairs 〈L1,L2〉 of lattices for which there is a finite partial unary algebra such that its weak and strong subalgebra lattices are isomorphic to L1 and L2, respectively. Next, we describe other pairs of subalgebra lattices (weak and relative, etc.) of a finite unary algebra. Finally, necessary a...
متن کاملOn Subalgebra Lattices of a Finite Unary Algebra I
One of the main aims of the present and the next part [15] is to show that the theory of graphs (its language and results) can be very useful in algebraic investigations. We characterize, in terms of isomorphisms of some digraphs, all pairs 〈A,L〉, where A is a finite unary algebra and L a finite lattice such that the subalgebra lattice of A is isomorphic to L. Moreover, we find necessary and su...
متن کاملOn Some Influence of the Weak Subalgebra Lattice on the Subalgebra Lattice
In [14] we showed that for each locally finite unary (total) algebra of finite type, its weak subalgebra lattice uniquely determines its (strong) subalgebra lattice. Now we generalize this fact to algebras having also finitely many binary operations (for example, groupoids, semigroups, semilattices). More precisely, we generalize some ideas from [14] to prove: Let A be a locally finite (total) ...
متن کاملOn Subgroupoid Lattices of Some Finite Groupoid
We investigate finite commutative groupoids G = 〈G, ◦〉 such that g ◦ h 6= g for all elements g, h of G. First, we show that for any such groupoid, its weak (i.e. partial) subgroupoid lattice uniquely determines its subgroupoid lattice. Next, we characterize the lattice of all weak subgroupoids of such a groupoid. This is a distributive finite lattice satisfying some combinatorial conditions con...
متن کاملRecursive Unary Algebras and Trees
Khoussainov, B. Recursive “nary algebras and trees, Annals of Pure and Applied Logic 67 (1994) 213-268. A unary algebra is an algebraic system d = (A,f,, ,L). wheref,, . ,fm are unary operations on A and n EW. In the paper we develop the theory ofeffective “nary algebras. We investigate well-known questions of constructive (recursive) model theory with respect to the class of unary algebras. In...
متن کامل